Design of -Liveness Enforcing Supervisors in Petri Nets
نویسندگان
چکیده
This paper presents a procedure for the design of supervisors that enforce the transitions in a given set to be live. -liveness enforcement corresponds to full liveness enforcement when equals the total set of transitions. Rather than assuming a given initial marking, this procedure generates at every iteration a convex set of admissible initial markings. In the case of full liveness enforcement and under certain conditions also in the case of -liveness enforcement, the convex set of each iteration includes the set of markings for which liveness/ -liveness can be enforced. When the procedure terminates, and if it terminates, the final convex set contains only markings for which -liveness can be enforced. Then, the supervisor keeping the Petri net (PN) marking in this convex set can be easily designed using the place invariant based approach. This paper focuses on the fully controllable and observable PNs. Several extensions of the procedure, including to partially controllable and observable PNs, are outlined.
منابع مشابه
T -Liveness Enforcement in Petri Nets Based on Structural Net Properties
We introduce a semidecidable procedure which, given a Petri net structure and a set T of transitions, synthesizes a supervisor enforcing the transitions in T to be live. We call this liveness property T -liveness. When T equals the total set of Petri net transitions, T -liveness corresponds to liveness. Enforcing only a subset of transitions to be live is useful when some Petri net transitions ...
متن کاملDesigning Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions
This paper proposes an analytical method for the synthesis of reversibility-enforcing supervisors for bounded Petri nets. The proposed method builds upon recent developments from (i) the theory of regions, that enables the design of Petri nets with pre-specified behavioral requirements, and (ii) the theory concerning the imposition of generalized mutual exclusion constraints on the net behavior...
متن کاملOn systematic methods to remove redundant monitors from liveness-enforcing net supervisors
Petri nets based deadlock prevention for flexible manufacturing systems has received much attention over the past decade, primarily due to the seminal work of Ezpeleta et al. in 1995. A Petri net based deadlock prevention mechanism is usually implemented by adding monitors or control places to a plant Petri net model such that liveness can be enforced. The significance of this methodology lies ...
متن کاملGeneralized Conditions for Liveness Enforcement and Deadlock Prevention in Petri Nets
This paper presents new results concerned with liveness, liveness of a subset of transitions and deadlock in Petri nets. Liveness is seen as a particular case of what we call T -liveness: all transitions in the set T are live. The first results characterize the relation between supervisors enforcing liveness and T -liveness with supervisors preventing deadlock. Then we introduce a class of Petr...
متن کاملA Method for the Synthesis of Liveness Enforcing Supervisors in Petri Nets
Given an arbitrary Petri net structure which may have uncontrollable and unobservable transitions and may be unbounded, the procedure described in this paper generates a supervisor for liveness enforcement. The supervisor is specified as a conjunction of linear marking inequalities. For all initial markings satisfying the linear marking inequalities, the supervised Petri net is live. Moreover, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009